An orthogonality theorem of dines related to moment problems and linear programming
نویسندگان
چکیده
منابع مشابه
SENSITIVITY ANALYSIS IN LINEAR-PLUS-LINEAR FRACTIONAL PROGRAMMING PROBLEMS
In this paper, we study the classical sensitivity analysis when the right - hand – side vector, and the coefficients of the objective function are allowed to vary.
متن کاملA goal programming approach for fuzzy flexible linear programming problems
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
متن کاملGrey prediction in linear programming problems
The purpose of this paper is describes the use of grey pridiction in linear programming problems. Some definitions and concepts of grey system theory are introduced and then, we introduced GM(1,1) and fractional order accumulation into grey model. Due to the fluctuation of prices and the lack of certainty data in the market, optimal production was calculated to optimize the profit from sales us...
متن کاملAn Ergodic Theorem for Stochastic Programming Problems?
To justify the use of sampling to solve stochastic programming problems one usually relies on a law of large numbers for random lsc (lower semicontinuous) functions when the samples come from independent, identical experiments. If the samples come from a stationary process, one can appeal to the ergodic theorem proved here. The proof relies on thèscalarization' of random lsc functions.
متن کاملSolving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory
سال: 1967
ISSN: 0021-9800
DOI: 10.1016/s0021-9800(67)80110-8